Type-based Diagnosis of CLP Programs

Type-based Diagnosis of CLP Programs

The paper presents a diagnosis tool for CLP programs. It deals with partial correct-ness w.r.t. speciications which describe procedure calls and successes. The space of possible speciications is restricted to a kind of regular types; we propose a generalization of the concept of types used in so called descriptive typing of logic programs. In particular we distinguish ground types from those co...

On Termination of Binary CLP Programs

Termination of binary CLP programs has recently become an important question in the termination analysis community. The reason for this is due to the fact that some of the recent approaches to termination of logic programs abstract the input program to a binary CLP program and conclude termination of the input program from termination of the abstracted program. In this paper we introduce a clas...

Schema-Guided Synthesis of CLP Programs

Static Analysis of CLP Programs overNumeric

Extended Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, xpoint and operational semantics 9]. Since the basic operational step in program execution is a test for solvability of constraints in a given algebraic structure, CLP has in addition an algebraic semantics. CLP is then a general paradigm which may be ...

A Transformation System for Modular CLP Programs

We propose a transformation system for CLP programs and modules. The framework is inspired by the one of Tamaki and Sato for pure logic programs 19]. Here, the use of CLP allows us to introduce some new operations such as splitting and constraint replacement. We provide two sets of applicability conditions. The rst one guarantees that the original and the transformed programs have the same comp...